Normal approximation and fourth moment theorems for monochromatic triangles

Given a graph sequence denote by T₃(G_n) the number of monochromatic triangles in a uniformly random coloring of the vertices of G_n with colors. In this paper we prove a central limit theorem (CLT) for T₃(G_n) with explicit error rates, using a quantitative version of the martingale CLT. We then relate this error term to the well-known fourth-moment phenomenon, which, interestingly, holds only when the number of colors satisfies . We also show that the convergence of the fourth moment is necessary to obtain a Gaussian limit for any , which, together with the above result, implies that the fourth-moment condition characterizes the limiting normal distribution of T₃(G_n), whenever . Finally, to illustrate the promise of our approach, we include an alternative proof of the CLT for the number of monochromatic edges, which provides quantitative rates for the results obtained in [7].     

Semiconvergence analysis of the randomized row iterative method and its extended variants

The row iterative method is popular in solving the large‐scale ill‐posed problems due to its simplicity and efficiency. In this work we consider the randomized row iterative (RRI) method to tackle this issue. First, we present the semiconvergence analysis of RRI method for the overdetermined and inconsistent system, and derive upper bounds for the noise error propagation in the iteration vectors. To achieve a least squares solution, we then propose an extended version of the RRI (ERRI) method, which in fact can converge in expectation to the solution of the overdetermined or underdetermined, consistent or inconsistent systems. Finally, some numerical examples are given to demonstrate the convergence behaviors of the RRI and ERRI methods for these types of linear system.     

Local linear convergence analysis of Primal–Dual splitting methods

In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.     

Quantitative estimations of bivariate summation‐integral–type operators

In this paper, we study the approximation properties of bivariate summation‐integral–type operators with two parameters . The present work deals within the polynomial weight space. The rate of convergence is obtained while the function belonging to the set of all continuous and bounded function defined on ([0],∞)(×[0],∞) and function belonging to the polynomial weight space with two parameters, also convergence properties, are studied. To know the asymptotic behavior of the proposed bivariate operators, we prove the Voronovskaya type theorem and show the graphical representation for the convergence of the bivariate operators, which is illustrated by graphics using Mathematica. Also with the help of Mathematica, we discuss the comparison by means of the convergence of the proposed bivariate summation‐integral–type operators and Szász‐Mirakjan‐Kantorovich operators for function of two variables with two parameters to the function. In the same direction, we compute the absolute numerical error for the bivariate operators by using Mathematica and is illustrated by tables and also the comparison takes place of the proposed bivariate operators with the bivariate Szász‐Mirakjan operators in the sense of absolute error, which is represented by table. At last, we study the simultaneous approximation for the first‐order partial derivative of the function.     

The double deflating technique for irreducible singular M-matrix algebraic Riccati equations in the critical case

As is known, Alternating-Directional Doubling Algorithm (ADDA) is quadratically convergent for computing the minimal nonnegative solution of an irreducible singular M-matrix algebraic Riccati equation (MARE) in the noncritical case or a nonsingular MARE, but ADDA is only linearly convergent in the critical case. The drawback can be overcome by deflating techniques for an irreducible singular MARE so that the speed of quadratic convergence is still preserved in the critical case and accelerated in the noncritical case. In this paper, we proposed an improved deflating technique to accelerate further the convergence speed – the double deflating technique for an irreducible singular MARE in the critical case. We proved that ADDA is quadratically convergent instead of linearly when it is applied to the deflated algebraic Riccati equation (ARE) obtained by a double deflating technique. We also showed that the double deflating technique is better than the deflating technique from the perspective of dimension of the deflated ARE. Numerical experiments are provided to illustrate that our double deflating technique is effective.     

On weak–strong uniqueness for the compressible Navier–Stokes system with non-monotone pressure law

We show the weak–strong uniqueness property for the compressible Navier–Stokes system with general non-monotone pressure law. A weak solution coincides with the strong solution emanating from the same initial data as long as the latter solution exists.     

The coupled-cluster formalism – a mathematical perspective

ABSTRACT

The Coupled-Cluster (CC) theory is one of the most successful high precision methods used to solve the stationary Schrödinger equation. In this article, we address the mathematical foundation of this theory with focus on the advances made in the past decade. Rather than solely relying on spectral gap assumptions (non-degeneracy of the ground state), we highlight the importance of coercivity assumptions – Gårding type inequalities – for the local uniqueness of the CC solution. Based on local strong monotonicity, different sufficient conditions for a local unique solution are suggested. One of the criteria assumes the relative smallness of the total cluster amplitudes (after possibly removing the single amplitudes) compared to the Gårding constants. In the extended CC theory the Lagrange multipliers are wave function parameters and, by means of the bivariational principle, we here derive a connection between the exact cluster amplitudes and the Lagrange multipliers. This relation might prove useful when determining the quality of a CC solution. Furthermore, the use of an Aubin–Nitsche duality type method in different CC approaches is discussed and contrasted with the bivariational principle.